A Distributed Instant Messaging Architecture based on the Pastry Peer-To-Peer Routing Substrate
نویسندگان
چکیده
Current Instant Messaging systems rely on architectures that include central, or only partly distributed, server(s). Although some systems can exchange messages peer-to-peer, the user registration and lookup are still based on a centralized solution. We have implemented a fully distributed instant messaging system by utilizing the Pastry peer-to-peer routing substrate. We use the Pastry object insertion functionality to insert user information when a user joins the network and a novel search engine to effectively perform distributed user lookup. Currently, our system runs in the FreePastry simulator and supports joining/leaving the network, searching for users and message exchange.
منابع مشابه
MADPastry: A DHT Substrate for Practicably Sized MANETs
Because of the increasing interest in mobile ad hoc networks (MANETs) and their inherent similarities to peer-to-peer networks a large number of routing protocols based on peer-to-peer networks have recently been presented to provide distributed network applications with e cient and indirect routing for MANETs. Thomas Zahn and Jochen Schiller suggested MADPastry, an integration of a DHT substra...
متن کاملXenoSearch: Distributed Resource Discovery in the XenoServer Open Platform
We describe the XenoSearch system for performing expressive resource discovery searches in a distributed environment. We represent server meta-data, such as their locations and facilities, as points in a multi-dimensional space and then express queries as predicates over these points. Each XenoSearch node holds a portion of this space and the key goal of XenoSearch is to direct queries to those...
متن کاملA Testbed-based Analysis of the Incorrect Lookup Routing Attack on the Pastry DHT
Distributed Hashtables (DHT), with Pastry [2] as a prominent representative, are one of the most recent peer-to-peer (P2P) architectures. DHTs scale well to the network size due to a small routing table and a hierarchical routing scheme. In Pastry, the number of routing entries scales logarithmically with respect to the number of participating nodes, because each node maintains route entries to...
متن کاملPastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storag...
متن کاملScalability of a Distributed Virtual Environment Based on a Selected Structured Peer-To-Peer Architecture
We investigate the scalability of distributed virtual environments (DVEs), which are based on a structured peer-to-peer (P2P) overlay. We are interested in the average network load and routing latency and how they depend on the number of hosts in the DVE. To this end, we study a prototypical DVE consisting of a simple game scenario and a P2P architecture based on Pastry and Scribe as proposed b...
متن کامل